Interpolating in Arithmetic Transform Algorithms
نویسندگان
چکیده
In this paper, we propose a unified theory for arithmetic transforms of a variety of discrete trigonometric transforms. The main contribution of this work is the elucidation of the interpolation process required in arithmetic transforms. We show that the interpolation method determines the transform to be computed. Several kernels were examined and asymptotic interpolation formulae were derived. Using the arithmetic transform theory, we also introduce a new algorithm for computing the discrete Hartley transform.
منابع مشابه
Solution of the Time-dependent Schrödinger Equation Using Interpolating Wavelets
An adaptive numerical method for solution of the time-dependent Schrödinger equation is presented. By using an interpolating wavelet transform the number of used points can be reduced, constructing an adaptive sparse point representation. Two di erent discretisation approaches are studied in 1D ; one point-based and one based on equidistant blocks. Due to the nature of the wavelet transform a s...
متن کاملA Short Survey on Arithmetic Transforms and the Arithmetic Hartley Transform
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new arithmetic transform for computing the discrete Hartley transform is introduced:...
متن کاملSome New Methods for Prediction of Time Series by Wavelets
Extended Abstract. Forecasting is one of the most important purposes of time series analysis. For many years, classical methods were used for this aim. But these methods do not give good performance results for real time series due to non-linearity and non-stationarity of these data sets. On one hand, most of real world time series data display a time-varying second order structure. On th...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملInterpolating coefficient systems and p-ordinary cohomology of arithmetic groups
We present an approach to Hida’s theory of p-adically interpolating the ordinary cohomology of arithmetic groups and we discuss some application of this approach to special values of L-functions. Mathematics Subject Classification (2010). 11F75, 11F33, 11F67.
متن کامل